Everything about Explicit Data Graph Execution totally explained
Explicit Data Graph Execution or
EDGE is an
instruction set architecture which takes a different path from the traditional
instruction /
register designs like
RISC and
CISC. Instead, EDGE processors map the computations required in a
basic block, called
operands, to a flexible reconfigurable routing layer, allowing the individual operations to communicate their results to the consuming operations without going through the bottleneck of a
register file. Each block is calculated in parallel in a different core, which may either be a self-sustained generic processor or an application-specific processor.
The EDGE
ISA is defined using the operations in a single block and facilitates encoding the data dependencies within the instruction itself to relieve the processor of detecting dependencies. The data dependencies are then used to model a dataflow graph (or a data graph) which is used as the abstraction used to express concurrency. Though EDGE ISAs make each instruction more expensive, the cost is ammortized as instruction block contains a large number of instructions (the reference TRIPS implementation uses a 1024-instruction window).
EDGE ISA works on a block-atomic model, for example, a block of instructions is an atomic unit of execution. All the processor cores which form the execution blocks are named in the ISA and blocks are mapped to them. A block of instructions doesn't have control statements, but can have predicated instructions. The dataflow graph is encoded using these blocks, by specifying the flow of data from one block of instructions to another, or to some storage area. Each block can individually be a sequential program or a SIMD program.
Further Information
Get more info on 'Explicit Data Graph Execution'.
|
External Link Exchanges
Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:
<a href="http://explicit_data_graph_execution.totallyexplained.com">Explicit Data Graph Execution Totally Explained</a>
Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned. |
